A Memory Controller for Improved Performance of Streamed Computations on Symmetric Multiprocessors
نویسندگان
چکیده
The growing disparity between processor and memory speeds has caused memory bandwidth to become the performance bottleneck for many applications. In particular, this performance gap severely impacts streamorientated computations such as (de)compression, encryption, and scientific vector processing. This paper describes the development of an intelligent memory interface that can exploit compiler-provided information on streamed memory access patterns to improve memory bandwidth. Simulation results show that such sharedmemory multiprocessor systems can deliver nearly the full attainable bandwidth with relatively modest hardware costs.
منابع مشابه
Bounds on Memory Bandwidth in Streamed Computations
The growing disparity between processor and memory speeds has caused memory bandwidth to become the performance bottleneck for many applications. In particular, this performance gap severely impacts stream-orientated computations such as (de)compression, encryption, text searching, and scientific (vector) processing. This paper looks at streaming computations and derives analytic upper bounds o...
متن کاملDesigning Practical Eecient Algorithms for Symmetric Multiprocessors
Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of eecient parallel algorithms for this platform currently poses several challenges. In this paper, we present a computational model for designing eecient algorithms for symmetric multiprocessors. We then use this model...
متن کاملDesigning Practical Efficient Algorithms for Symmetric Multiprocessors
Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of eecient parallel algorithms for this platform currently poses several challenges. In this paper, we present a computational model for designing eecient algorithms for symmetric multiprocessors. We then use this model...
متن کاملDesigning Practical Eecient Algorithms for Symmetric Multiprocessors ? (extended Abstract)
Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of eecient parallel algorithms for this platform currently poses several challenges. In this paper , we present a computational model for designing eecient algorithms for symmetric multiprocessors. We then use this mode...
متن کاملPreex Computations on Symmetric Multiprocessors (preliminary Draft)
We introduce a new optimal preex computation algorithm on linked lists which builds upon the sparse ruling set approach of Reid-Miller and Blelloch. Besides being somewhat simpler and requiring nearly half the number of memory accesses, we can bound our complexity with high probability instead of merely on average. Moreover, whereas Reid-Miller and Blelloch targeted their algorithm for implemen...
متن کامل